Gradient eigendecomposition invariance biogeography-based optimization for mobile robot path planning

نویسندگان

چکیده

The path planning for mobile robots has attracted extensive attention, and evolutionary algorithms have been applied to this problem increasingly. In paper, we propose a novel gradient eigendecomposition invariance biogeography-based optimization (GEI-BBO) robot planning, which the merits of high rotation excellent search performance. GEI-BBO, design an mechanism migration operation, can reduce dependency (BBO) on coordinate system, improve share information between eigensolutions more effectively. Meanwhile, find local optimal solution better, descent is added, system strategy occurrence trapping phenomenon. addition, combining GEI-BBO with cubic spline interpolation will solve through defined coding method fitness function. A series experiments are implemented benchmark functions, whose results indicated that performance superior other algorithms. And successful application in different environments confirms its effectiveness practicability.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning of Mobile Robot using Bacteria Foraging Optimization

Path planning related to mobile robots is the construction of the collision free trajectories that direct robots towards their goal. In this paper, a bio inspired approach based on the foraging behaviour of the bacteria (E-coli) has been proposed to design an optimal path for the robot. The present approach admires that the mobile robot is capable of reaching the goal by following the optimum p...

متن کامل

A gradient-based path optimization method for motion planning

Most algorithms in probabilistic sampling-based path planning compute collision-free paths made of straight line segments lying in the configuration space. Due to the randomness of sampling, the paths make detours that need to be optimized. The contribution of this paper is to propose a basic gradient-based (GB) algorithm that transforms a polygonal collision-free path into a shorter one. While...

متن کامل

Path Following and Velocity Optimizing for an Omnidirectional Mobile Robot

In this paper, the path following controller of an omnidirectional mobile robot (OMR) has been extended in such a way that the forward velocity has been optimized and the actuator velocity constraints have been taken into account. Both have been attained through the proposed model predictive control (MPC) framework. The forward velocity has been included into the objective function, while the a...

متن کامل

Virtual Door-Based Coverage Path Planning for Mobile Robot

This paper presents a novel coverage path planning method in indoor environment for a mobile robot such as cleaning robot. Overall region is divided into several sub-regions based on the virtually extracted doors. The algorithm is inspired from the usual way of dividing an indoor environment into sub-regions, i.e., rooms based on the identification of doors. The virtual door algorithm extracts ...

متن کامل

Path Planning Algorithm for Mobile Robot

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2022

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-022-07075-y